Abstracts – Browse Results

Search or browse again.

Click on the titles below to expand the information about each abstract.
Viewing 8 results ...

Abeysinghe, G and Urand, D (1999) Why Use Enactable Models of Construction Processes?. Journal of Construction Engineering and Management, 125(06), 437–47.

Kartam, S (1999) Generic Methodology for Analyzing Delay Claims. Journal of Construction Engineering and Management, 125(06), 409–19.

Lee, H, Lee, J and Lee, J (1999) Nonshored Formwork System for Top-Down Construction. Journal of Construction Engineering and Management, 125(06), 392–9.

Leu, S and Yang, C (1999) GA-Based Multicriteria Optimal Model for Construction Scheduling. Journal of Construction Engineering and Management, 125(06), 420–7.

Leung, A W T and Tam, C M (1999) Models for Assessing Hoisting Times of Tower Cranes. Journal of Construction Engineering and Management, 125(06), 385–91.

Lippiatt, B C (1999) Selecting Cost-Effective Green Building Products: BEES Approach. Journal of Construction Engineering and Management, 125(06), 448–55.

Ndekugri, I (1999) Performance Bonds and Guarantees: Construction Owners and Professionals Beware. Journal of Construction Engineering and Management, 125(06), 428–36.

Zouein, P P and Tommelein, I D (1999) Dynamic Layout Planning Using a Hybrid Incremental Solution Method. Journal of Construction Engineering and Management, 125(06), 400–8.

  • Type: Journal Article
  • Keywords:
  • ISBN/ISSN: 0733-9364
  • URL: https://doi.org/10.1061/(ASCE)0733-9364(1999)125:6(400)
  • Abstract:
    Efficiently using site space to accommodate resources throughout the duration of a construction project is a critical problem. It is termed the “dynamic layout planning” problem. Solving it involves creating a sequence of layouts that span the entire project duration, given resources, the timing of their presence on site, their changing demand for space over time, constraints on their location, and costs for their relocation. A dynamic layout construction procedure is presented here. Construction resources, represented as rectangles, are subjected to two-dimensional geometric constraints on relative locations. The objective is to allow site space to all resources so that no spatial conflicts arise, while keeping distance-based adjacency and relocation costs minimal. The solution is constructed stepwise for consecutive time frames. For each resource, selected heuristically one at a time, constraint satisfaction is used to compute sets of feasible positions. Subsequently, a linear program is solved to find the optimal position for each resource so as to minimize all costs. The resulting sequence of layouts is suboptimal in terms of the stated global objective, but the algorithm helps the layout planner explore better alternative solutions.